An Incremental Temporal Partitioning Method for Real-Time Reconfigurable Systems

In this paper, a temporal partitioning algorithm is presented which partitions data flow graphs in a realtime domain. Timing constraint is a critical factor in temporal partitioning of real-time reconfigurable design. An incremental algorithm is presented to partition data flow graphs while meeting the timing constraints by obtaining the target number of partitions. In addition, the proposed algorithm attempts to minimize the logic resources used for implementing the real-time application. In this algorithm, selecting the appropriate nodes and moving them between subsequent partitions results in more area balanced partitions and less number of partitions. Key-Words: Reconfigurable computing system, Temporal partitioning, Real-time system, Data flow graph.